On conditional edge-fault-tolerant cycles embedding of hypercubes

The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks

The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the network. Edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant hamiltonicity of an interconnection network. In this paper, we first study the property of edge-disjoint Hamiltonian cycles in tr...

Edge-fault-tolerant edge-bipancyclicity of hypercubes

In this paper, we consider the problem embedding a cycle into the hypercube Qn with existence of faulty edges and show that for any edge subset F of Qn with |F | n− 1 every edge of Qn − F lies on a cycle of every even length from 6 to 2n inclusive provided n 4 and all edges in F are not incident with the same vertex. This result improves some known results.  2005 Published by Elsevier B.V.

Edge-fault-tolerant properties of hypercubes and folded hypercubes

The Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications

In this paper, we present an interconnection structure, called the balanced hypercube, which is a variation of the standard hypercube with desirable properties of strong connectivity, regularity, and symmetry. The proposed structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that share...

Edge Congestion and Topological Properties of Crossed Cubes

An dimensional crossed cube, CQ,,, is a variation of hypercubes. in this paper, we give a new shortest path routing algorithm based on a new distance measure defined hsreln. In comparison with Efe's algorithm, which generates one shortest path in O(ri2) time, our algorithm can generate more shortest paths in O ( n ) time. Based on a given shortest path routing algorithm, we consider a new perfo...